Experimental repository Directory structure: `instances`: The instances used for the experiments sorted by their category. `output_data`: Raw output data from the experiments. `plots`: Plots generated from our experiments; also contain the plots used in the paper. `results`: Collected data on running time and proof size for the encodings. `source_code`: The source code of our `kissat_fork` to output VeriPB proofs, the proof checker `VeriPB` and our certifying PB-to-CNF translation library `VeritasPBLib` as used for our experiments
The original publication is available at www.springerlink.com. Abstract. This paper answers affirmat...
Abstract. Recent solvers for quantified boolean formulas (QBF) use a clause learning method based on...
International audienceThis paper answers affirmatively the open question of the existence of a polyn...
Experimental repository for the paper "Certified Core-Guided MaxSAT Solving" Directory structure...
Experimental repository for the paper "Certified Core-Guided MaxSAT Solving" Directory structure...
The dramatic improvements in Boolean satisfiability (SAT) solving since the turn of the millennium h...
Code and Data supplement to "Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guid...
Research noteThis paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows un...
We provide here the binary, options and experimental data for our CADE paper and the companion repor...
International audienceProperty-based testing (PBT) is a technique for validating code against an exe...
Compared are different methods for evaluation of formulas expressing microprocessor correctness in t...
Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is g...
Despite the NP-completeness of Boolean satisfiability, modern SAT solvers are routinely able to hand...
The original publication is available at www.springerlink.com. Abstract. This paper answers affirmat...
Abstract. Recent solvers for quantified boolean formulas (QBF) use a clause learning method based on...
International audienceThis paper answers affirmatively the open question of the existence of a polyn...
Experimental repository for the paper "Certified Core-Guided MaxSAT Solving" Directory structure...
Experimental repository for the paper "Certified Core-Guided MaxSAT Solving" Directory structure...
The dramatic improvements in Boolean satisfiability (SAT) solving since the turn of the millennium h...
Code and Data supplement to "Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guid...
Research noteThis paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows un...
We provide here the binary, options and experimental data for our CADE paper and the companion repor...
International audienceProperty-based testing (PBT) is a technique for validating code against an exe...
Compared are different methods for evaluation of formulas expressing microprocessor correctness in t...
Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is g...
Despite the NP-completeness of Boolean satisfiability, modern SAT solvers are routinely able to hand...
The original publication is available at www.springerlink.com. Abstract. This paper answers affirmat...
Abstract. Recent solvers for quantified boolean formulas (QBF) use a clause learning method based on...
International audienceThis paper answers affirmatively the open question of the existence of a polyn...